Minimal comparability completions of arbitrary graphs
نویسندگان
چکیده
منابع مشابه
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of the graph. Not every graph has a transitive orientation, but every graph can be turned into a graph that has a transitive orientation, by adding edges. We study the problem of adding an inclusion minimal set of edges to ...
متن کاملMaking Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
A transitive orientation of an undirected graph is an assignment of directions to itsedges so that these directed edges represent a transitive relation between the vertices ofthe graph. Not every graph has a transitive orientation, but every graph can be turnedinto a graph that has a transitive orientation, by adding edges. We study the problem ofadding an inclusion minimal set ...
متن کاملMinimal comparability completions
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...
متن کاملMinimal Split Completions of Graphs
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a split graph, called a split completion of the input graph. Our purpose is to add an inclusion minimal set of edges to obtain a minimal split completion, which means that no proper subset of the added edges is sufficient to create a split completion. Minimal completions of arbitrary graphs into chord...
متن کاملMinimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. This problem is closely related to the problem of adding an inclusion minimal set of edges to a graph to obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.08.039